Optimal Morphs of Convex Drawings
نویسندگان
چکیده
We give an algorithm to compute a morph between any two convex drawings of the same plane graph. The morph preserves the convexity of the drawing at any time instant and moves each vertex along a piecewise linear curve with linear complexity. The linear bound is asymptotically optimal in the worst case. 1998 ACM Subject Classification G.2.2. Graph Theory
منابع مشابه
Optimal Morphs of Planar Orthogonal Drawings
We describe an algorithm that morphs between two planar orthogonal drawings ΓI and ΓO of a connected graph G, while preserving planarity and orthogonality. Necessarily ΓI and ΓO share the same combinatorial embedding. Our morph uses a linear number of linear morphs (linear interpolations between two drawings) and preserves linear complexity throughout the process, thereby answering an open ques...
متن کاملConvexity-Increasing Morphs of Planar Graphs
We study the problem of convexifying drawings of planar graphs. Given any planar straight-line drawing of a 3-connected graph G, we show how to morph the drawing to one with convex faces while maintaining planarity at all times. Furthermore, the morph is convexity increasing, meaning that angles of inner faces never change from convex to reflex. We give a polynomial time algorithm that construc...
متن کاملA Bent Edge Morph for Planar Graph Drawings
We give an algorithm to morph between two planar graph drawings of a graph, preserving planarity. The morph uses a polynomial number of elementary steps. Each step, is composed of a linear morph or a sequence of two linear morphs allowing a vertex to change direction. The planarity is preserved by allowing edges to bend to avoid collisions with the features of the drawing. This algorithm also p...
متن کاملMorphing Planar Graphs in Spherical Space
We consider the problem of intersection-free planar graph morphing, and in particular, a generalization from Euclidean space to spherical space. We show that there exists a continuous and intersectionfree morph between two sphere drawings of a maximally planar graph, provided that both sphere drawings have convex inscribed polytopes, where sphere drawings are the spherical equivalent of plane d...
متن کاملMorphing Schnyder Drawings of Planar Triangulations
We consider the problem of morphing between two planar drawings of the same triangulated graph, maintaining straight-line planarity. A paper in SODA 2013 gave a morph that consists of O(n) steps where each step is a linear morph that moves each of the n vertices in a straight line at uniform speed [1]. However, their method imitates edge contractions so the grid size of the intermediate drawing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015